Consequence-Based Reasoning for SHIQ
نویسندگان
چکیده
We propose a novel consequence-based algorithm for TBox reasoning in SHIQ. This work is at very early stage: we have no experimental results and we have not even proved completeness. Instead, we focus on explaining the intuitions behind the algorithm, and show that it has all the favorable properties of existing consequence-based algorithms, namely optimal worst-case complexity, one-pass classification, and pay-as-you-go behavior.
منابع مشابه
Consequence-Driven Reasoning for Horn SHIQ Ontologies
We present a novel reasoning procedure for Horn SHIQ ontologies—SHIQ ontologies that can be translated to the Horn fragment of first-order logic. In contrast to traditional reasoning procedures for ontologies, our procedure does not build models or model representations, but works by deriving new consequent axioms. The procedure is closely related to the so-called completion-based procedure for...
متن کاملExtending Consequence-Based Reasoning to SHIQ
Description logics (DLs) [3] are a family of knowledge representation formalisms with numerous practical applications. SHIQ is a particularly important DL as it provides the formal underpinning for the Web Ontology Language (OWL). DLs model a domain of interest using concepts (i.e., unary predicate symbols) and roles (i.e., binary predicate symbols). DL applications often rely on subsumption—th...
متن کاملConstructing E-SHIQ Distributed Knowledge Bases via Ontology Modularization: The mONTul method
This article presents a reconfigurable method for the modularization of SHIQ ontologies, towards the construction of distributed E − SHIQ knowledge bases. The aim is to compute decompositions for correct, complete and efficient distributed reasoning. The proposed method combines graph-based modularization techniques with localitybased rules using a generic constraint problem solving framework. ...
متن کاملFinite Model Reasoning in Horn-SHIQ
Finite model reasoning in expressive DLs such as ALCQI and SHIQ requires non-trivial algorithmic approaches that are substantially differerent from algorithms used for reasoning about unrestricted models. In contrast, finite model reasoning in the inexpressive fragment DL-LiteF of ALCQI and SHIQ is algorithmically rather simple: using a TBox completion procedure that reverses certain terminolog...
متن کاملTerminological Reasoning in SHIQ with Ordered Binary Decision Diagrams
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent fragment of the Web Ontology Language OWL. The algorithm is based on ordered binary decision diagrams (OBDDs) as a datastructure for storing and operating on large model representations. We thus draw on the success and the proven scalability of OBDD-based systems. To the best of our knowledge, we...
متن کامل